Location-Scale Matching for Approximate Quasi-Order Sampling

Filtration Algorithms for Approximate Order-Preserving Matching

The exact order-preserving matching problem is to find all the substrings of a text T which have the same length and relative order as a pattern P . Like string maching, order-preserving matching can be generalized by allowing the match to be approximate. In approximate order-preserving matching two strings match if they have the same relative order after removing up to k elements in the same p...

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

Approximate Pattern Matching with Grey Scale Values

Approximate Pattern Matching with Grey Scale Values

We design an e cient algorithm for approximate pattern matching with grey scale values. The grey scale values range over interval [0;R] where R is a positive real number and the error bound for matching is measured by kR where k is a non-negative integer. Then we show that our algorithm solves this problem for the one-dimensional problem with O(kn logm=m) expected time, which is sublinear, wher...

adaptive approximate record matching

typographical data entry errors and incomplete documents, produce imperfect records in real world databases. these errors generate distinct records which belong to the same entity. the aim of approximate record matching is to find multiple records which belong to an entity. in this paper, an algorithm for approximate record matching is proposed that can be adapted automatically with input error...